Transitive Closure and the LOGA+-Strategy for its Efficient Evaluation
نویسندگان
چکیده
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive queries. During the last few years many algorithms have been proposed to deal with transitive closure computation of a relation. In this paper, we discuss some important criteria for developing transitive closure algorithms. After presenting these issues, we describe an algorithm for transitive closure computation and show some results of performance measurements comparing several algorithms.
منابع مشابه
The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملThe Complexity of the Evaluation of Complex Algebra Expressions
The Abiteboul and Beeri algebra for complex objects can express a query whose meaning is transitive closure, but the algorithm naturally associated to this query needs exponential space. We show that any other query in the algebra which expresses transitive closure needs exponential space, under a \call by value" evaluation strategy. This proves that in general the powerset is an intractable op...
متن کاملPerformance evaluation of algorithms for transitive closure
This paper presents the results of an experimental evaluation of the performance of three main algorithms for transitive closure: Seminaive, Smart and Blocked Warren. The algorithms have been implemented using a variety of join methods (block nested-loops and hash-join), disk-based and memory-based data structures and buffer replacement strategies. The algorithms were tested on several graphs, ...
متن کاملA Parallel Strategy for Transitive Closure usind Double Hash-Based Clustering
We present a parallel algorithm to compute the transitive closure of a relation. The transitive closure operation has been recognized as an important extension of the relational algebra. The importance of the performance problem brought by its evaluation brings one to consider parallel execution strategies. Such strategies constitute one of the keys to efficiency in a very large data base envir...
متن کاملPairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
In this paper, we show how well-known graph-theoretic techniques can be successfully exploited to efficiently reason about partially ordered events in Kowalski and Sergot’s Event Calculus and in its skeptical and credulous modal variants. We replace the traditional generate-and-test strategy of basic Event Calculus by a generate-only strategy that operates on the transitive closure and reductio...
متن کامل